A new efficient indexing algorithm for one-dimensional real scaled patterns
نویسندگان
چکیده
Article history: Received 15 July 2007 Received in revised form 7 December 2010 Accepted 5 May 2011 Available online 12 May 2011
منابع مشابه
Efficient Indexing for One-dimensional Proportionally-scaled Patterns
Related problems of scaled matching and indexing, which aim to determine all positions in a text T that a pattern P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, but do not allow shrunk patterns since they may disappear. In this paper, we give the definition and an efficient indexi...
متن کاملThe indexing for one-dimensional proportionally-scaled strings
a r t i c l e i n f o a b s t r a c t Related problems of scaled matching and indexing, which aim to determine all positions in a text T that a pattern P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, and do not allow shrunk patterns since they may disappear. In this paper, we give ...
متن کاملEfficient One Dimensional Real Scaled Matching
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision. In this paper, we present a new, more precise and realistic, definition for one dimensional real scaled matching, and an efficient alg...
متن کاملEfficient indexing algorithms for one-dimensional discretely-scaled strings
a r t i c l e i n f o a b s t r a c t The discretely-scaled string indexing problem asks one to preprocess a given text string T , so that for a queried pattern P , the matched positions in T that P appears with some discrete scale can be reported efficiently. For solving this problem, Wang et al. first show that with an O (|T | log |T |)-time preprocessing on T , all matched positions can be r...
متن کاملEfficient Similarity Indexing and Searching in High Dimensions
Efficient indexing and searching of high dimensional data has been an area of active research due to the growing exploitation of high dimensional data and the vulnerability of traditional search methods to the " curse of dimensionality ". This paper presents a new approach for fast and effective searching and indexing of high dimensional features using random partitions of the feature space. Ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 78 شماره
صفحات -
تاریخ انتشار 2012